Jumping with random reals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Strong Random Reals

The class of strong random reals can be defined via a natural conception of effective null set. We show that the same class is also characterized by a learning-theoretic criterion of ‘recognizability’. 1. Characterizing randomness. Consider a physical process that, if suitably idealized, generates an indefinite sequence of independent random bits. One such process might be radioactive decay of ...

متن کامل

Notes on random reals

The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They review just the most elementary part of the theory (bearing on Kolmogorovand Martin-Löf-randomness). We hope that the simple arguments presented here will encour...

متن کامل

Random Semicomputable Reals Revisited

The aim of this paper is to present a nice series of results, obtained in the papers of Chaitin [2], Solovay [5], Calude et al. [1], Kucera and Slaman [3]. This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a “Chaitin Omega” and those that are maximal for Solovay reducibility. The original proofs were somewhat involved; ...

متن کامل

Random Reals and Ω 1 →

The purpose of this note will be to extend the results of J. Barnett and S. Todorčević concerning the influence MAא1 has on random graphs. I will demonstrate that if MAא1 holds then ω1 → (ω1, (α : α)) holds for every α < ω1 after the addition of any number of random reals.

متن کامل

Genericity and UD-random reals

Avigad introduced the notion of UD-randomness based in Weyl’s 1916 definition of uniform distribution modulo one. We prove that there exists a weakly 1-random real that is neither UD-random nor weakly 1-generic. We also show that no 2-generic real can Turing compute a UD-random real. 2000 Mathematics Subject Classification 03D32 (primary); 03D80 (secondary)

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1990

ISSN: 0168-0072

DOI: 10.1016/0168-0072(90)90019-x